On linear-time algorithms for five-coloring planar graphs
نویسندگان
چکیده
منابع مشابه
On Linear-Time Algorithms for Five-Coloring Planar Graphs
It is well known that the vertices of a planar graph can be colored with no more than four colors [l]. However, the rather detailed proof of this fact leads to a @(n*) algorithm for determining such a coloring. To yield faster algorithms, several authors have considered generating a fivecoloring rather than a four-coloring [4]. Recently, two different approaches to five-coloring planar graphs h...
متن کاملImproved Edge-Coloring Algorithms for Planar Graphs
An edge-coloring of a graph G is an assignment of colors to the edges of G such that edges with a common endpoint have different colors. Let x’(G) denote the chromatic index of G, that is the minimum number of colors necessary to color the edges of G. Vizing [25] proved that x’(G) is either A(G) or A(G) + 1 for each graph G, where A(G) denotes the maximum degree of a vertex in G (see also [9])....
متن کاملFive-list-coloring graphs on surfaces II. A linear bound for critical graphs in a disk
Let G be a plane graph with outer cycle C and let (L(v) : v ∈ V (G)) be a family of sets such that |L(v)| ≥ 5 for every v ∈ V (G). By an L-coloring of a subgraph J of G we mean a (proper) coloring φ of J such that φ(v) ∈ L(v) for every vertex v of J . We prove a conjecture of Dvořák et al. that if H is a minimal subgraph of G such that C is a subgraph of H and every L-coloring of C that extends...
متن کاملFive-list-coloring graphs on surfaces I. Two lists of size two in planar graphs
Let G be a plane graph with outer cycle C, let v1, v2 ∈ V (C) and let (L(v) : v ∈ V (G)) be a family of sets such that |L(v1)| = |L(v2)| = 2, |L(v)| ≥ 3 for every v ∈ V (C) \ {v1, v2} and |L(v)| ≥ 5 for every v ∈ V (G) \ V (C). We prove a conjecture of Hutchinson that G has a (proper) coloring φ such that φ(v) ∈ L(v) for every v ∈ V (G). We will use this as a lemma in subsequent papers. Septemb...
متن کاملColoring Meyniel graphs in linear time
A Meyniel graph is a graph in which every odd cycle of length at least five has two chords. We present a linear-time algorithm that colors optimally the vertices of a Meyniel graph and finds a clique of maximum size.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 1984
ISSN: 0020-0190
DOI: 10.1016/0020-0190(84)90056-5